package WEEK_188;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

public class Test {

	public static void main(String[] args) {
		Solution solution = new Solution();
		/*
		 * int[] target = {1,2,3}; List<String> res =solution.buildArray(target, 3);
		 * System.out.println(res);
		 */
		/*
		 * int[] arr = {2,3,1,6,7}; int res =solution.countTriplets(arr);
		 * System.out.println(res);
		 */

		/*
		 * int[][] edges = { { 0, 1 }, { 0, 2 }, { 1, 4 }, { 1, 5 }, { 2, 3 }, { 2, 6 }
		 * };
		 * 
		 * List<Boolean> hasApple = new LinkedList<Boolean>(); hasApple.add(false);
		 * hasApple.add(false); hasApple.add(true); hasApple.add(false);
		 * hasApple.add(false); hasApple.add(true); hasApple.add(false); int res =
		 * solution.minTime_topo(7, edges, hasApple); System.out.println(res);
		 */

		String[] pizza = { ".A", "AA", "A." };
		int res = solution.ways(pizza, 3);
		System.out.println(res);

	}

}
